Evolutionary algorithm to traveling salesman problems
نویسندگان
چکیده
منابع مشابه
Using Fuzzy Evolutionary Programming to Solve Traveling Salesman Problems
In this paper we present an efficient decomposition technique to speed up evolutionary algorithms when dealing with large scale optimization problems. Divide and conquer methods aim to solving problems in smaller entities and then combining the sub-solutions to form complete solutions. Often the optimal way to divide the problem varies as the evolutionary algorithm proceeds, thus making a stati...
متن کاملITO-based evolutionary algorithm to solve traveling salesman problem
In this paper, a ITO algorithm inspired by ITO stochastic process is proposed for Traveling Salesmen Problems (TSP),so far, many meta-heuristic methods have been successfully applied to TSP, however, as a member of them, ITO needs further demonstration for TSP. So starting from designing the key operators, which include the move operator, wave operator, etc, the method based on ITO for TSP is p...
متن کاملTraveling salesman path problems
In the traveling salesman path problem, we are given a set of cities, traveling costs between city pairs and fixed source and destination cities. The objective is to find a minimum cost path from the source to destination visiting all cities exactly once. In this paper, we study polyhedral and combinatorial properties of a variant we call the traveling salesman walk problem, in which the object...
متن کاملParallel Evolutionary Algorithm for the Traveling Salesman Problem
In this paper we present a evolutionary algorithm for solving traveling salesman problem (TSP). It deals with testing feasible solutions which are local minima. This method is based on the following observation: if there are the same elements in some positions in several permutations, which are local minima, then these elements are in the same position in the optimal solution. Computational exp...
متن کاملChaos Driven Evolutionary Algorithm for the Traveling Salesman Problem
Donald Davendra1∗, Ivan Zelinka1, Roman Senkerik2 and Magdalena Bialic-Davendra3 1Department of Informatics, Faculty of Electrical Engineering and Computing Science, Technical University of Ostrava, Tr. 17. Listopadu 15, Ostrava 2Department of Informatics and Artificial Intelligence, Faculty of Informatics, Tomas Bata University in Zlin, Nad Stranemi 4511, Zlin 76001 3Department of Finance and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2012
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2011.12.018